منابع مشابه
Incidence cuts and connectivity in fuzzy incidence graphs
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...
متن کاملPolynomiality of sparsest cuts with fixed number of sources
We show that when the number of sources is constant the sparsest cut problem is solvable in polynomial time. © 2007 Elsevier B.V. All rights reserved.
متن کاملEdge-cuts in Graphs
In an earlier paper [3], we studied cycles in graphs that intersect all edge-cuts of prescribed sizes. Passing to a more general setting, we examine the existence of T -joins in grafts that intersect all edge-cuts whose size is in a given set A ⊆ {1, 2, 3}. In particular, we characterize all the contractionminimal grafts admitting no T -joins that intersect all edge-cuts of size 1 and 2. We als...
متن کاملGraphs of plural cuts
Plural (or multiple-conclusion) cuts are inferences made by applying a structural rule introduced by Gentzen for his sequent formulation of classical logic. As singular (singleconclusion) cuts yield trees, which underlie ordinary natural deduction derivations, so plural cuts yield graphs of a more complicated kind, related to trees, which this paper defines. Besides the inductive definition of ...
متن کاملDistances and cuts in planar graphs
We prove the following theorem. Let G = (V, E) be a planar bipartite graph, embedded in the etrclidean plane. Let 0 and I be two of its faces. Then there exist pairwise edge-disjoint cuts C,, . . . . C, so that for each two vertices u, w with U, w E 0 or V, WE I, the distance from u to w in G is equal to the number of cuts C, separating u and w. This theorem is dual to a theorem of Okamura on p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1990
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90133-w